A New Degree Bound for Vector Invariants of Symmetric Groups
نویسنده
چکیده
Let R be a commutative ring, V a nitely generated free R-module and G leGL R (V) a nite group acting naturally on the graded symmetric algebra A = S(V). Let (V; G) denote the minimal number m, such that the ring A G of inva riants can be generated by nitely many elements of degree at most m. For G = n and V (n; k), the k-fold direct sum of the natural permutat ion module, one knows that (V (n; k); n) n, provided that n! is invertible in R. This was used by E.Noether to prove (V; G) jGj if jGj! 2 R. In this paper we prove (V (n; k); n) maxfn; k(n ? 1)g for arbitrary com-mutative rings R and show equality for n = p s a prime power and R = Zor any ring with n 1 R = 0. Our results imply (V; G) maxfjGj; rank(V)(jGj ? 1)g for any ring with jGj 2 R .
منابع مشابه
New Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملAG - Invariantentheorie NOETHER ’ S BOUND IN THE INVARIANT THEORY OF FINITE GROUPS AND VECTOR INVARIANTS OF ITERATED WREATH PRODUCTS OF SYMMETRIC GROUPS LARRY
Let ρ : G GL(n, IF) be a faithful representation of the finite group G over the field IF. In 1916 E. Noether proved that for IF of characteristic zero the ring of invariants IF[V ]G is generated as an algebra by the invariant polynomials of degree at most G. This result has been generalized to the case where the characteristic of IF is greater than G, or when the characteristic of IF is pri...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملPolynomial Bounds for Rings of Invariants
Hilbert proved that invariant rings are finitely generated for linearly reductive groups acting rationally on a finite dimensional vector space. Popov gave an explicit upper bound for the smallest integer d such that the invariants of degree ≤ d generate the invariant ring. This bound has factorial growth. In this paper we will give a bound which depends only polynomially on the input data.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007